The MacWilliams identity for $m$-spotty weight enumerator over $\mathbb{F}_2+u\mathbb{F}_2+\cdots+u^{m-1}\mathbb{F}_2$
نویسنده
چکیده
Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an m-spotty byte error, which can be effectively detected or corrected using byte error-control codes. The MacWilliams identity provides the relationship between the weight distribution of a code and that of its dual. The main purpose of this paper is to present a version of the MacWilliams identity for m-spotty weight enumerators over F2+uF2+ · · ·+u m−1 F2 (shortly Ru,m,2). keywords : Byte error-control codes; m-spotty byte error; MacWilliams identity
منابع مشابه
On cyclic DNA codes over $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$
In the present paper we study the structure of cyclic DNA codes of even length over the ring F2 + uF2 + u 2 F2 where u 3 = 0. We investigate two presentations of cyclic codes of even length over F2 + uF2 + u 2 F2 satisfying the reverse constraint and the reverse-complement constraint.
متن کاملLinear codes with few weights over $\mathbb{F}_2+u\mathbb{F}_2$
In this paper, we construct an infinite family of five-weight codes from trace codes over the ring R = F2+uF2, where u 2 = 0. The trace codes have the algebraic structure of abelian codes. Their Lee weight is computed by using character sums. Combined with Pless power moments and Newton’s Identities, the weight distribution of the Gray image of trace codes was present. Their support structure i...
متن کاملOn Quantum Codes Obtained From Cyclic Codes Over $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$
The aim of this paper is to develop the theory for constructing DNA cyclic codes of odd length over R = Z4[u]/〈u 2 − 1〉. Firstly, we relate DNA pairs with a special 16 element of ring R. Cyclic codes of odd length over R satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the GC-content of these codes and their deletion distance. The p...
متن کاملSelf-Dual Codes over $\mathbb{Z}_2\times (\mathbb{Z}_2+u\mathbb{Z}_2)$
In this paper, we study self-dual codes over Z2× (Z2+uZ2), where u 2 = 0. Three types of self-dual codes are defined. For each type, the possible values α, β such that there exists a code C ⊆ Z2×(Z2+uZ2) β are established. We also present several approaches to construct self-dual codes over Z2 × (Z2 + uZ2). Moreover, the structure of two-weight self-dual codes is completely obtained for α · β 6...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1307.2228 شماره
صفحات -
تاریخ انتشار 2013